Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions
نویسندگان
چکیده
منابع مشابه
Monotonic Fuzzy Systems As Universal Approximators For Monotonic Functions
In this paper, we propose a constructive method to develop a fuzzy system having a monotonic input–output relationship and prove that the developed fuzzy system can approximate any continuously differentiable monotonic function with any desired degree of accuracy. The fuzzy system is constructed with complete and consistent input membership functions and imposes special parametric constraints o...
متن کاملA model for non-monotonic intensity coding
Peripheral neurons of most sensory systems increase their response with increasing stimulus intensity. Behavioural responses, however, can be specific to some intermediate intensity level whose particular value might be innate or associatively learned. Learning such a preference requires an adjustable trans- formation from a monotonic stimulus representation at the sensory periphery to a non-mo...
متن کاملFast Monotonic Algorithms for Transmission Tomography
We present a framework for designing fast and monotonic algorithms for transmission tomography penalized-likelihood image reconstruction. The new algorithms are based on paraboloidal surrogate functions for the log-likelihood. Due to the form of the log-likelihood function, it is possible to find low curvature surrogate functions that guarantee monotonicity. Unlike previous methods, the propose...
متن کاملMonotonic and Dual Monotonic Language
Monotonic and dual monotonic language learning from positive as well as from positive and negative examples is investigated. Three di erent notions of monotonicity are considered. Each of them re ects an alternative formalization of the requirement that the learner has to produce better and better generalizations when fed more and more data on the concept to be learned. Strong{monotonicity abso...
متن کاملFast Admission Control for Rate Monotonic Schedulers
Rate monotonic traffic scheduling algorithm had been shown [1] to be the optimal static priority assignment scheme. The system model studied in [1] can be considered (although not realistic) as a preemptive multiplexer which accepts constant bit rate connections that generate packets periodically. The multiplexer adopts a service discipline such that a lower priority packet can be preempted at ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2013.2281695